Soft computing optimization methods applied to logistic processes
نویسندگان
چکیده
منابع مشابه
Soft computing methods for applied shape optimization
vided the structural mechanics computations in the joint paper [135]. Beyond the fruitful cooperation, my special thanks go to Sebastian for helping out many times in any kind of issue related to this dissertation. I also appreciate the Deutsche Forschungsgemeinschaft (DFG) for financial support in the Graduiertenkolleg 853 " Modellierung, Simulation und Optimierung von Ingenieuranwen-dungen " .
متن کاملFuzzy Optimization of Logistic Processes
This paper addresses the problem of optimizing logistic processes that can be modeled as birth and death processes. A fuzzy decision making algorithm is proposed to dynamically assign components to orders. This algorithm tries to minimize the overall delivery delays and, at the same type, prefers orders with high priorities. A compromise between these conflicting goals is achieved by using weig...
متن کاملComparison of Classical Method and Soft Computing Optimization Algorithm applied to Economic load Dispatch Problem
This paper presents a comparative study of classical method and soft computing optimization algorithm applied to solve Economic Load Dispatch problem with non-smooth fuel cost curves considering transmission losses, power balance and capacity constraints. The soft computing algorithm varies from the classical method in terms of the following basic factors. The genetic algorithm based approach p...
متن کاملOptimization of Logistic Processes Using Predictive Ants
In previous papers, we have shown that the Ant Colony Optimization (ACO) algorithm could be used as a distributed scheduling strategy for logistic processes. The distributed framework allow us to easily introduce new features that can improve the scheduling methods. An example is a prediction mechanism, introduced in this paper. A statistical model of the system provides a reliable prediction m...
متن کاملOptimization of Logistic Processes Using Ant Colonies∗
The scheduling of logistic processes modeled by birth-anddeath processes is a combinatorial problem. We consider here the problem of dynamic assignment of components to orders. In this paper, a distributed algorithm based on ant colonies is proposed to optimize this assignment. The ant-agents jointly test several different combinations and choose the solution that is able to deliver more orders...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2005
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2005.06.004